Link Proposals with Case-Based Reasoning Techniques
نویسندگان
چکیده
In this paper, we will discuss the problem of proposing links for hypertexts based on Case-Based Reasoning (CBR) techniques. These proposals can be used in addition to traditional textual based methods. At first, we will focus on the basic ideas of CBR. Next, its modeling for Hyperlink-Management Systems will be discussed, and finally the usefulness of CBR in the area of link proposals will be evaluated. The measuring of the quality of link proposals in terms of "recall" and "precision" has to be refined in order to describe the performance of the system adequately.
منابع مشابه
Advanced Studies on Link Proposals and Knowledge Retrieval of Hypertexts with CBR
In this paper, several problems in associating hyperlinks to text and the diverse possibilities to overcome these problems are discussed. At the current stage, an important aspect is knowledge retrieval of hypertexts. Our advanced studies on hyperlink management focus mainly on a concept similar to Case-Based Reasoning (CBR) systems as a possibility for the automatic generation of links for hyp...
متن کاملPersuasive Precedents
Stories can be a powerful vehicle of persuasion. We typically use stories to link known events into coherent wholes. One way to establish coherence is to appeal to past examples, real or fictitious. These examples can be chosen and critiqued using legal case-based reasoning (CBR) techniques. In this paper, we apply these techniques to factual stories, assessing a story about the facts using pre...
متن کاملJusletter IT - What Makes a Story Plausible?
When reasoning about the facts of a case, we typically use stories to link the known events into coherent wholes. One way to establish coherence is to appeal to past examples, real or fictitious. These examples can be chosen and critiqued using the case-based reasoning (CBR) techniques from the AI and Law literature. In this paper, we apply these techniques to factual stories, assessing a story...
متن کاملINTEGRATING CASE-BASED REASONING, KNOWLEDGE-BASED APPROACH AND TSP ALGORITHM FOR MINIMUM TOUR FINDING
Imagine you have traveled to an unfamiliar city. Before you start your daily tour around the city, you need to know a good route. In Network Theory (NT), this is the traveling salesman problem (TSP). A dynamic programming algorithm is often used for solving this problem. However, when the road network of the city is very complicated and dense, which is usually the case, it will take too long fo...
متن کاملImproving Agent Performance for Multi-Resource Negotiation Using Learning Automata and Case-Based Reasoning
In electronic commerce markets, agents often should acquire multiple resources to fulfil a high-level task. In order to attain such resources they need to compete with each other. In multi-agent environments, in which competition is involved, negotiation would be an interaction between agents in order to reach an agreement on resource allocation and to be coordinated with each other. In recent ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000